Quadratic compact knapsack public-key cryptosystem
نویسندگان
چکیده
منابع مشابه
Linearly shift knapsack public-key cryptosystem
In this paper, we propose two algorithms to improve the Merkle-Hellman knapsack public-key cryptosystem. First, we propose an approach to transform a superincreasing sequence to a " high den-sity'' knapsack sequence. The algorithm is easy to implement and eliminates the redundancy of many knapsack cryptosystems. Second, a linearly shift method is used to improve the security of the knapsack pub...
متن کاملCryptanalysis of a New Knapsack Type Public-Key Cryptosystem
— Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the low-density attack. We show that this cryptosystem is not secure, as it based on basic Merkel-Hellman knapsack cryptosystem and because of the superincreasi...
متن کاملKnapsack Public-Key Cryptosystem Using Chinese Remainder Theorem
The realization of the quantum computer will enable to break publickey cryptosystems based on factoring problem and discrete logarithm problem. It is considered that even the quantum computer can not solve NP -hard problem in a polynomial time. The subset sum problem is known to be NP -hard. Merkle and Hellman proposed a knapsack cryptosystem using the subset sum problem. However, it was broken...
متن کاملA New Trapdoor in Modular Knapsack Public-Key Cryptosystem
Merkle and Hellman proposed a first knapsack cryptosystem. However, it was broken because the density is not sufficiently high. In this paper, we propose a a new trapdoor in modular knapsack PKC. Proposed scheme can use the message encoding. This method can use the method of enlarging messages over a finite field in order to realize a high density over 1. Keywords— Knapsack public-key cryptosys...
متن کاملCryptanalysis of a quadratic knapsack cryptosystem
Wang and Hu [B. Wang and Y. Hu, Quadratic compact knapsack public-key cryptosystem, Comput. Math. Appl. 59 (1) (2010) 194–206] proposed a knapsack-type public-key cryptosystem by introducing an easy quadratic compact knapsack problem and then using the Chinese remainder theorem to disguise the easy knapsack instant. In this paper, we present a heuristic stereotyped message attack that allows th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2009.08.031